Scalable Generation of Graph-State Entanglement Through Realistic Linear Optics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient generation of large number-path entanglement using only linear optics and feed-forward.

We show how an idealized measurement procedure can condense photons from two modes into one and how, by feeding forward the results of the measurement, it is possible to generate efficiently superposition states commonly called N00N states. For the basic procedure sources of number states leak onto a beam splitter, and the output ports are monitored by photodetectors. We find that detecting a f...

متن کامل

Open-system dynamics of graph-state entanglement.

We consider graph states of an arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely, the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. ...

متن کامل

Purification of single-photon entanglement with linear optics

We show that single-photon entangled states of the form |0>|1>+|1>|0> can be purified with a simple linear-optics based protocol, which is eminently feasible with current technology. Besides its conceptual interest, this result is relevant for attractive quantum repeater

متن کامل

Minimal State Graph Generation

We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veriication and control synthesis in reactive program compilation.

متن کامل

Minimal State Graph Generation

We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veri cation and control synthesis in reactive program compilation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2006

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.97.143601